Task Allocation Algorithm through Minimizing Processing Cost in Distributed Network

A distributed network consists of multiple autonomous computers that communicate through a communication media. In distributed network in which a task is divided into many fractions and each of which is to be get processed. The task allocation problem can be explained in terms of number of tasks and number of processors available. According to the task allocation problem if the number of task are more then the number of processors and every processor process the task in a particular time period for processing any particular task then we have to allocate each task to the single processor in such a way that the processing cost should be minimal. The number of processors and number of tasks are static in nature. If the number of processors is denoted by P and the number of tasks is denoted by T then as in general all real world problem T>P.